Efficient Clustering of Water Distribution Network Using Affinity Propagation
نویسندگان
چکیده
منابع مشابه
Subspace clustering using affinity propagation
This paper proposes a subspace clustering algorithm by introducing attribute weights in the affinity propagation algorithm. A new step is introduced to the affinity propagation process to iteratively update the attribute weights based on the current partition of the data. The relative magnitude of the attribute weights can be used to identify the subspaces in which clusters are embedded. Experi...
متن کاملAffinity Propagation Clustering Using Path Based Similarity
Clustering is a fundamental task in data mining. Affinity propagation clustering (APC) is an effective and efficient clustering technique that has been applied in various domains. APC iteratively propagates information between affinity samples, updates the responsibility matrix and availability matrix, and employs these matrices to choose cluster centers (or exemplars) of respective clusters. H...
متن کاملAutomatically Affinity Propagation Clustering using Particle Swarm
Affinity propagation (AP) is a clustering algorithm which has much better performance than traditional clustering approach such as K-means algorithm. AP can usually find a moderate clustering number, but “moderate” usually may not be the “optimal”. If we have found the optimal clustering number of AP, to estimate the input “preferences” (p) and the effective corresponding “preferences” (p) inte...
متن کاملDocument Clustering Approaches using Affinity Propagation
Document clustering as an unsupervised approach extensively used to navigate, filter, summarize and manage large collection of document repositories like the World Wide Web (WWW). Recently, Document clustering is the process of segmenting a particular collection of texts into subgroups including content based similar ones. The purpose of document clustering is to meet human interests in informa...
متن کاملAdaptive Affinity Propagation Clustering
Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter ‘preference’ can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingénierie des systèmes d information
سال: 2020
ISSN: 1633-1311,2116-7125
DOI: 10.18280/isi.250414